I Nformation S Tructure , D Iscourse S Tructure and D
نویسندگان
چکیده
We present an implementation of a discourse parsing system for a lexicalized Tree-Ajoining Grammar for discourse, specifying the integration of sentence and discourse level processing. Our system is based on the assumption that the compositional aspects of semantics at the discourse-level parallel those at the sentence-level. This coupling is achieved by factoring away inferential semantics and anaphoric features of discourse connectives. Computationally, this parallelism is achieved because both the sentence and discourse grammar are LTAG-based and the same parser works at both levels. The approach to a LTAG for discourse has been developed by (Webber & Joshi 1998; Webber et al. 1999b) (among others) in some recent papers. Our system takes a discourse as input, parses the sentences individually, extracts the basic discourse units from the sentence derivations, and reparses the discourse with reference to the discourse grammar.
منابع مشابه
I Nformation S Tructure , D Iscourse S Tructure and D Iscourse
We present an implementation of a discourse parsing system for a lexicalized Tree-Ajoining Grammar for discourse, specifying the integration of sentence and discourse level processing. Our system is based on the assumption that the compositional aspects of semantics at the discourse-level parallel those at the sentence-level. This coupling is achieved by factoring away inferential semantics and...
متن کاملPrinciple Based Semantics for HPSG
The paper presents a constraint based semantic formalism for HPSG. The syntax-semantics interface directly implements syntactic conditions on quantifier scoping and distributivity. 1 The construction of semantic representations is guided" by general principles governing the interaction between syntax and semantics. Each of these principles acts as a constraint to narrow down the set of possible...
متن کاملABL: Alignment-Based Learning
This ])al)er introdu(:es a new tyl)e of grammar learning algorithm, iilst)ired l)y sl;ring edit distance (Wagner and Fis(:her, 1974). The algor i thm takes a (:ortms of tlat S(~lltell(:es as input and returns a (:ortms of lat)elled, l)ra(:ket(~(1 sen-~ ten(:(~s. The method works on 1)airs of unstru(:tllr(?(l SelltellC(~,s that have one or more words in ( :onunon. W]lc, ll two senten( 'es are (t...
متن کاملEfficient Searches for Similar Subsequences of Different Lengths in Sequence Databases
We propose an indexing technique for fast retrieval of s imilar s ubsequences us ing t ime w arping di stances. A time wa rping d istance is a mo re suitable similarity meas ure t han t he Eucl idean di stance in many a pplications, where sequences may be of different lengths o r different sampling rates. Our indexing technique uses a dis k-based suffix tree as an index s tructure and employs l...
متن کامل